A Semantic Approach to Nonmonotonic Reasoning: Inference Operations and Choice
نویسنده
چکیده
This paper presents a uniform semantic treatment of nonmonotonic inference operations that allow for inferences from infinite sets of premisses. The semantics is formulated in terms of selection functions and is a generalization of the preferential semantics of Shoham (1987), (1988), Kraus, Lehman, and Magidor (1990) and Makinson (1989), (1993). A selection function picks out from a given set of possible states (worlds, situations, models) a subset consisting of those states that are, in some sense, the most preferred ones. A proposition α is a nonmonotonic consequence of a set of propositions Γ iff α holds in all the most preferred Γ-states. In the literature on revealed preference theory, there are a number of well-known theorems concerning the representability of selection functions, satisfying certain properties, in terms of underlying preference relations. Such theorems are utilized here to give corresponding representation theorems for nonmonotonic inference operations. At the end of the paper, the connection between nonmonotonic inference and belief revision, in the sense of Alchourrón, Gärdenfors, and Makinson, is explored. In this connection, infinitary belief revision operations, that allow for the revision of a theory with a possibly infinite set of propositions, are introduced and characterized axiomatically. Several semantic representation theorems are proved for operations of this kind.
منابع مشابه
Rationality in human nonmonotonic inference
This article tests human inference rationality when dealing with default rules. To study human rationality, psychologists currently use classical models of logic or probability theory as normative models for evaluating human ability to reason rationally. Our position is that this approach is convincing, but only manages to capture a specific case of inferential ability with little regard to con...
متن کاملSemantics for Constrained and Rational Default Logics
The default nonmonotonic reasoning was formalised by a class of logical systems: default logics (classical, justified, constrained, rational), based on the same syntax which utilises nonmonotonic inference rules: defaults, but with different semantics for the defaults. In this paper we introduce a uniform semantic characterisation for the constrained and rational extensions of a default theory....
متن کاملContributions to the Theory of Nonmonotonic Inference Systems
In the present paper an approach to nonmonotonic reasoning is discussed which is inspired by the paradigm of abstract model theory. The aim is to analyse non-monotonic reasoning within the framework of inference operations based on model operators. This is done by using the concept of a deductive frame and its semantical counterpart, a semantical frame. These are considered as a basis for nonmo...
متن کاملNonmonotonic inference operations
A. Tarski [21] proposed the study of infinitary consequence operations as the central topic of mathematical logic. He considered monotonicity to be a property of all such operations. In this paper, we weaken the monotonicity requirement and consider more general operations, inference operations. These operations describe the nonmonotonic logics both humans and machines seem to be using when inf...
متن کاملIntelligent Filtering using Nonmonotonic Inference
This article documents initial explorations into the suitability of using nonmonotonic reasoning to lter information. Both syntactic and semantic issues are given attention. User preferences are represented by defaults. Initial ideas on how defaults van be derived from relevance feedback are presented. Conclusions are that the semantic framework holds promise as it corresponds to what document ...
متن کامل